Strong Equivalence of Nonmonotonic Theories -- an Algebraic Approach
نویسنده
چکیده
We show that the concept of strong equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong equivalence for several nonmonotonic logics including logic programming with aggregates, default logic and a version of autoepistemic logic.
منابع مشابه
A Strong Regular Relation on ?-Semihyperrings
The concept of algebraic hyperstructures introduced by Marty as a generalization of ordinary algebraic structures. In an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. The concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyperrings and a generalizat...
متن کاملHyperequivalence of Programs and Operators
Recent research in nonmonotonic logic programming has focused on different notions of program equivalence relevant for program optimization and modular programming. So far, most results concern the stable-model semantics. However, other semantics for logic programs are also of interest, especially the semantics of supported models which, when properly generalized, is closely related to a promin...
متن کاملEquivalence in Abductive Logic
We consider the problem of identifying equivalence of two knowledge bases which are capable of abductive reasoning. Here, a knowledge base is written in either first-order logic or nonmonotonic logic programming. In this work, we will give two definitions of abductive equivalence. The first one, explainable equivalence, requires that two abductive programs have the same explainability for any o...
متن کاملRelativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report
For a given semantics, two nonmonotonic theories Π1 and Π2 can be said to be equivalent if they have the same intended models and strongly (resp., uniformly) equivalent if for any Σ, Π1∪Σ and Π2∪Σ are equivalent, where Σ is a set of sentences (resp., literals). In the general case, no restrictions are placed on the language (signature) of Σ. Relativised notions of strong and uniform equivalence...
متن کاملAn equivalence functor between local vector lattices and vector lattices
We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006